The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0, zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0) → ok(0)
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
incr(mark(X)) →⁺ mark(incr(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / mark(X)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
active, cons, s, incr, adx, head, tail, proper, top

They will be analysed ascendingly in the following order:
cons < active
s < active
incr < active
adx < active
head < active
tail < active
active < top
cons < proper
s < proper
incr < proper
adx < proper
head < proper
tail < proper
proper < top

(8) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
cons, active, s, incr, adx, head, tail, proper, top

They will be analysed ascendingly in the following order:
cons < active
s < active
incr < active
adx < active
head < active
tail < active
active < top
cons < proper
s < proper
incr < proper
adx < proper
head < proper
tail < proper
proper < top

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cons.

(10) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
s, active, incr, adx, head, tail, proper, top

They will be analysed ascendingly in the following order:
s < active
incr < active
adx < active
head < active
tail < active
active < top
s < proper
incr < proper
adx < proper
head < proper
tail < proper
proper < top

(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol s.

(12) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
incr, active, adx, head, tail, proper, top

They will be analysed ascendingly in the following order:
incr < active
adx < active
head < active
tail < active
active < top
incr < proper
adx < proper
head < proper
tail < proper
proper < top

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol incr.

(14) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
adx, active, head, tail, proper, top

They will be analysed ascendingly in the following order:
adx < active
head < active
tail < active
active < top
adx < proper
head < proper
tail < proper
proper < top

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol adx.

(16) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
head, active, tail, proper, top

They will be analysed ascendingly in the following order:
head < active
tail < active
active < top
head < proper
tail < proper
proper < top

(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol head.

(18) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
tail, active, proper, top

They will be analysed ascendingly in the following order:
tail < active
active < top
tail < proper
proper < top

(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol tail.

(20) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
active, proper, top

They will be analysed ascendingly in the following order:
active < top
proper < top

(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol active.

(22) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
proper, top

They will be analysed ascendingly in the following order:
proper < top

(23) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol proper.

(24) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

The following defined symbols remain to be analysed:
top

(25) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol top.

(26) Obligation:

TRS:
Rules:
active(incr(nil)) → mark(nil)
active(incr(cons(X, L))) → mark(cons(s(X), incr(L)))
active(adx(nil)) → mark(nil)
active(adx(cons(X, L))) → mark(incr(cons(X, adx(L))))
active(nats) → mark(adx(zeros))
active(zeros) → mark(cons(0', zeros))
active(head(cons(X, L))) → mark(X)
active(tail(cons(X, L))) → mark(L)
active(incr(X)) → incr(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(adx(X)) → adx(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
incr(mark(X)) → mark(incr(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
adx(mark(X)) → mark(adx(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(incr(X)) → incr(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(adx(X)) → adx(proper(X))
proper(nats) → ok(nats)
proper(zeros) → ok(zeros)
proper(0') → ok(0')
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
incr(ok(X)) → ok(incr(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
adx(ok(X)) → ok(adx(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
incr :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nil :: nil:mark:nats:zeros:0':ok
mark :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
cons :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
s :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
adx :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
nats :: nil:mark:nats:zeros:0':ok
zeros :: nil:mark:nats:zeros:0':ok
0' :: nil:mark:nats:zeros:0':ok
head :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
tail :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
proper :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
ok :: nil:mark:nats:zeros:0':ok → nil:mark:nats:zeros:0':ok
top :: nil:mark:nats:zeros:0':ok → top
hole_nil:mark:nats:zeros:0':ok1_0 :: nil:mark:nats:zeros:0':ok
hole_top2_0 :: top
gen_nil:mark:nats:zeros:0':ok3_0 :: Nat → nil:mark:nats:zeros:0':ok

Generator Equations:
gen_nil:mark:nats:zeros:0':ok3_0(0) ⇔ nil
gen_nil:mark:nats:zeros:0':ok3_0(+(x, 1)) ⇔ mark(gen_nil:mark:nats:zeros:0':ok3_0(x))

No more defined symbols left to analyse.